A Verified Decision Procedure for Pseudo-Boolean Formulas
نویسندگان
چکیده
Pseudo-Boolean formulas consist of constraints of the form ∑i=1 wi · xi k, where xi are propositional literals, wi ∈ Z, k ∈ Z, and arise in planning, scheduling and optimization problems. We describe an efficient and easily verifiable decision procedure for pseudo-Boolean formulas, that is based on encoding PB formulas into the propositional satisfiability problem with the cutting-edge sequential weighted counter encoding. State-of-the-art SAT solvers that emit unsatisfiability proofs are used to solve the resulting instances. The combination of a verified translation to SAT, and certified SAT solvers leads to a verified decision procedure for PB formulas. The verification of the encoding is carried out in the Coq proof assistant.
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملModel Checking with Quantified Boolean Formulas
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...
متن کاملSolving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas
An SMT-solving procedure can be implemented by using a SAT solver to find a satisfying assignment of the propositional skeleton of the predicate formula and then deciding the feasibility of the assignment using a particular decision procedure. The complexity of the decision procedure depends on the size of the assignment. In case that the runtime of the solving is dominated by the decision proc...
متن کاملLemmas on Demand for Satisfiability Solvers
We investigate the combination of propositional SAT checkers with satisfiability procedures for domain-specific theories such as linear arithmetic, arrays, lists and the combination thereof. Our procedure realizes a lazy approach to satisfiability checking of Boolean constraint formulas by iteratively refining Boolean formulas based on lemmas generated on demand by the decision procedures.
متن کاملFormulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximating a pseudo-Boolean random variable by a linear function if the measure is permutation-invariant, and by a function of degree at most k if the measure is a product measure. These formulas generalize results due to Ham...
متن کامل